Volume 6, Issue 4, pp. 879-1162
Please Note: Electronic articles are available well in advance of the printed articles.
Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method
James Renegar
pp. 879-912
Parallel Decomposition: Results for Staircase Linear Programs
Robert Entriken
pp. 961-977
On the Superlinear Convergence of an $O(n^3 L)$ Interior-Point Algorithm for the Monotone LCP
Kevin A. McShane
pp. 978-993
Algorithms for the Generalized Linear Complementarity Problem with a Vertical Block $Z$-Matrix
S. R. Mohan and S. K. Neogy
pp. 994-1006
Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional
Leonid Faybusovich
pp. 1007-1024
A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
Thomas F. Coleman and Yuying Li
pp. 1040-1058
A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
Masao Fukushima and Liqun Qi
pp. 1106-1120
Rates of Convergence in Stochastic Programs with Complete Integer Recourse
Rüdiger Schultz
pp. 1138-1152
Optimality of Nested Partitions and Its Application to Cluster Analysis
E. Boros and F. K. Hwang
pp. 1153-1162
